Generalized Buffering Algorithm

The existing buffers algorithms cannot effectively to meet the demands of high accuracy buffer analysis in practice although many efforts have been made past 60 years. A generalized buffering algorithm (GBA) is presented, which considers geometric distance and attribute characteristics all instances within zone. proposed includes three major steps: (1) select initialize target instance; (2) determine boundary points through mining homogeneous pattern; (3) “smoothly” connect generate details for generations point (GPIB) zone, line (GLB) polygon (GPLB) zone are discussed. Two dataset used validate performances GBA. Six parameters applied as indexes evaluate algorithm. experimental results discovered that (1) GBA close tradition (TBA) when angle increment ( $\Delta \varphi$ ) GPIB, L$ GLB, arc length S$ GPLB approach zero, respectively; rid="deqn2" xmlns:xlink="http://www.w3.org/1999/xlink">(2) can accurately reflect real situation improve deficiency TBA application.